Challange to Complexity; (5). Genetic Algorithms.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Complexity and Genetic Algorithms

Recent theory work has suggested that the genetic algorithm (GA) complexity of a problem can be measured by the growth rate of the minimum problem representation [1]. This paper describes a method for evaluating the computational complexity of a problem specifically for a GA. In particular, we show that the GAcomplexity of a problem is determined by the growth rate of the minimum representation...

متن کامل

Time Complexity of genetic algorithms on exponentially scaled problems

This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to study GA performance on this type of problems because one of the difficulties that GAs are generally faced with is due to the low scaling or low salience of some building blocks. The paper is an extension of the model ...

متن کامل

Polynomial Complexity Search, Problem Diiculty and Genetic Algorithms

A blackbox optimization problem can be diicult to solve because of 1) inherent problem complexity class 2) inadequate representation and 3) inappropriate search bias. In this paper I address the last two issues. Starting from the rst principle, the fundamental requirements for polynomial complexity search are discussed. This points toward identifying some necessary representational requirements...

متن کامل

Population Size and Sampling Complexity in Genetic Algorithms

Determining an appropriate population size is an important task in the design of genetic algorithms and is closely related to the principle of implicit parallelism. In this paper, the problem of bounding the population size is formulated as that of minimization of sampling errors. Using techniques from computational learning theory, two lower bounds on the population size are established. The l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of the Institute of Television Engineers of Japan

سال: 1996

ISSN: 0386-6831,1884-9652

DOI: 10.3169/itej1978.50.609